Date: Tue, 05 Nov 1996 20:37:15 GMT
Server: NCSA/1.5
Content-type: text/html
Last-modified: Tue, 22 Oct 1996 19:51:23 GMT
Content-length: 17437

<HTML>
<HEAD><TITLE> Papers of Michael C. Ferris </TITLE></HEAD>
<BODY>
<H1> Papers of Michael C. Ferris </H1>
<DL>

<DT> <A NAME="ferris.pang:complementarity"> [FP96] </DT>
<DD>
M.~C. Ferris and J.~S. Pang, editors.
<STRONG>Complementarity and Variational Problems: State of the Art</STRONG>,
  Philadelphia, Pennsylvania, 1996. SIAM.
</DD>

<DT> <A NAME="ferris.zavriev:linear"> [FZ96] </DT>
<DD>
M. C. Ferris and S. K Zavriev.
<STRONG>The linear convergence of a successive linear programming
  algorithm</STRONG>.
Technical report, Computer Sciences Department, University of Wisconsin,
  Madison, Wisconsin, 1996.
</DD>

<DT> <A NAME="anderson.ferris:direct"> [AF96] </DT>
<DD>
E. J. Anderson and M. C. Ferris.
<STRONG>A direct search algorithm for optimization with noisy function
  evaluations</STRONG>.
Technical report, Computer Sciences Department, University of Wisconsin,
  Madison, Wisconsin, 1996.
</DD>

<DT><!WA0><A NAME="ferris.mesnier.ea:neos"
  HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/96-08.ps.Z">
  [FMM96]</A></DT>
<DD>
M. C. Ferris, M. P. Mesnier, and J. Mor\'e.
<STRONG>The NEOS system for complementarity problems: PATH</STRONG>.
Mathematical Programming Technical Report 96-08, Computer Sciences Department,
  University of Wisconsin, Madison, Wisconsin, 1996.
Also available as MCS-P616-1096, Mathematics and Computer Science Division,
  Argonne National Laboratory.
</DD>

<DT> <A NAME="tin-loi.ferris:holonomic"> [TLF97] </DT>
<DD>
F. Tin-Loi and M. C. Ferris.
<STRONG>Holonomic analysis of quasibrittle fracture with nonlinear
  softening</STRONG>.
In <EM>Ninth International Conference on Fracture, April 1-5, 1997</EM>, 1997.
Accepted for publication in Proceedings.
</DD>

<DT><!WA1><A NAME="dirkse.ferris:crash"
  HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/95-22.ps.Z">
  [DF96]</A></DT>
<DD>
S. P. Dirkse and M. C. Ferris.
<STRONG>Crash techniques for large-scale complementarity problems</STRONG>.
In M.~C. Ferris and J.~S. Pang, editors, <EM>Complementarity and Variational
  Problems: State of the Art</EM>, Philadelphia, Pennsylvania, 1996. SIAM.
</DD>

<DT><!WA2><A NAME="billups.dirkse.ea:comparison"
  HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/95-16.ps.Z">
  [BDF96]</A></DT>
<DD>
S. C. Billups, S. P. Dirkse, and M. C. Ferris.
<STRONG>A comparison of large scale mixed complementarity problem
  solvers</STRONG>.
<EM>Computational Optimization and Applications, forthcoming</EM>, 1996.
</DD>

<DT> <A NAME="ferris.mangasarian:breast"> [FM95] </DT>
<DD>
M. C. Ferris and O. L. Mangasarian.
<STRONG>Breast cancer diagnosis via linear programming</STRONG>.
<EM>{IEEE} Computational Science and Engineering</EM>, 2:70-71, 1995.
</DD>

<DT> <A NAME="bohringer.ferris.ea:exemptions"> [BFR95] </DT>
<DD>
C. B\"ohringer, M. C. Ferris, and T. F. Rutherford.
<STRONG>Exemptions, grandfathered permits and the costs of emission
  restrictions: Results from a general equilibrium model for six EU
  countries</STRONG>.
In <EM>Economic Aspects of Environmental Policy Making in a Federal
  System</EM>, 1995.
</DD>

<DT><!WA3><A NAME="ferris.rutherford:accessing"
  HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/95-10.ps.Z">
  [FR96]</A></DT>
<DD>
M. C. Ferris and T. F. Rutherford.
<STRONG>Accessing realistic complementarity problems within Matlab</STRONG>.
In G.~Di Pillo and F.~Giannessi, editors, <EM>Proceedings of Nonlinear
  Optimization and Applications Workshop, Erice June 1995</EM>, New York, 1996.
  Plenum Press.
</DD>

<DT><!WA4><A NAME="billups.ferris:qpcomp"
  HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/95-09.ps.Z">
  [BF96]</A></DT>
<DD>
S. C. Billups and M. C. Ferris.
<STRONG>QPCOMP: A quadratic program based solver for mixed complementarity
  problems</STRONG>.
<EM>Mathematical Programming, forthcoming</EM>, 1996.
</DD>

<DT><!WA5><A NAME="ferris.pang:engineering"
  HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/95-07.ps.Z">
  [FP95]</A></DT>
<DD>
M. C. Ferris and J. S. Pang.
<STRONG>Engineering and economic applications of complementarity
  problems</STRONG>.
Discussion Papers in Economics 95-7, Department of Economics, University of
  Colorado, Boulder, Colorado, 1995.
</DD>

<DT><!WA6><A NAME="ferris.meeraus.ea:computing"
  HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/95-03.ps.Z">
  [FMR95]</A></DT>
<DD>
M. C. Ferris, A. Meeraus, and T. F. Rutherford.
<STRONG>Computing Wardropian equilibrium in a complementarity
  framework</STRONG>.
Mathematical Programming Technical Report 95-03, Computer Sciences Department,
  University of Wisconsin, Madison, Wisconsin, 1995.
</DD>

<DT><!WA7><A NAME="eckstein.ferris:operator*1"
  HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/94-17.ps.Z">
  [EF94]</A></DT>
<DD>
J. Eckstein and M. C. Ferris.
<STRONG>Operator splitting methods for monotone affine variational
  inequalities, with a parallel application to optimal control</STRONG>.
Mathematical Programming Technical Report 94-17, Computer Sciences Department,
  University of Wisconsin, Madison, Wisconsin, 1994.
</DD>

<DT><!WA8><A NAME="ferris.lucidi.ea:nonmonotone"
  HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/94-16.ps.Z">
  [FLR96]</A></DT>
<DD>
M. C. Ferris, S. Lucidi, and M. Roma.
<STRONG>Nonmonotone curvilinear stabilization techniques for unconstrained
  optimization</STRONG>.
<EM>Computational Optimization and Applications</EM>, 6:117-136, 1996.
</DD>

<DT><!WA9><A NAME="billups.ferris:solutions"
  HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/94-15.ps.Z">
  [BF94]</A></DT>
<DD>
S. C. Billups and M. C. Ferris.
<STRONG>Solutions to affine generalized equations using proximal
  mappings</STRONG>.
Mathematical Programming Technical Report 94-15, Computer Sciences Department,
  University of Wisconsin, Madison, Wisconsin, 1994.
</DD>

<DT><!WA10><A NAME="ferris.ralph:projected"
  HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/94-08.ps.Z">
  [FR95]</A></DT>
<DD>
M. C. Ferris and D. Ralph.
<STRONG>Projected gradient methods for nonlinear complementarity problems via
  normal maps</STRONG>.
In D.~Du, L.~Qi, and R.~Womersley, editors, <EM>Recent Advances in Nonsmooth
  Optimization</EM>, pages 57-87. World Scientific Publishers, 1995.
</DD>

<DT><!WA11><A NAME="ferris.horn:partitioning"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1232.ps.Z">
  [FH94]</A></DT>
<DD>
M. C. Ferris and J. D. Horn.
<STRONG>Partitioning mathematical programs for parallel solution</STRONG>.
Technical Report 1232, Computer Sciences Department, University of Wisconsin,
  Madison, Wisconsin, May 1994.
</DD>

<DT><!WA12><A NAME="dirkse.ferris:pathsearch"
  HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/94-03.ps.Z">
  [DF96]</A></DT>
<DD>
S. P. Dirkse and M. C. Ferris.
<STRONG>A pathsearch damped Newton method for computing general
  equilibria</STRONG>.
<EM>Annals of Operations Research, forthcoming</EM>, 1996.
</DD>

<DT><!WA13><A NAME="cao.ferris:lineality"
  HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/94-02.ps.Z">
  [CF95]</A></DT>
<DD>
M. Cao and M. C. Ferris.
<STRONG>Lineality removal for copositive-plus normal maps</STRONG>.
<EM>Communications on Applied Nonlinear Analysis</EM>, 2:1-10, 1995.
</DD>

<DT><!WA14><A NAME="cao.ferris:pc"
  HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/94-01.ps.Z">
  [CF96]</A></DT>
<DD>
M. Cao and M. C. Ferris.
<STRONG>$P_C$ matrices and the linear complementarity problem</STRONG>.
<EM>Linear Algebra and Its Applications</EM>, 246:299-312, 1996.
</DD>

<DT><!WA15><A NAME="dirkse.ferris:mcplib"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1215.ps.Z">
  [DF95]</A></DT>
<DD>
S. P. Dirkse and M. C. Ferris.
<STRONG>MCPLIB: A collection of nonlinear mixed complementarity
  problems</STRONG>.
<EM>Optimization Methods and Software</EM>, 5:319-345, 1995.
</DD>

<DT><!WA16><A NAME="ferris.pang:nondegenerate"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/94/tr1203.ps.Z">
  [FP96]</A></DT>
<DD>
M. C. Ferris and J. S. Pang.
<STRONG>Nondegenerate solutions and related concepts in affine variational
  inequalities</STRONG>.
<EM>SIAM Journal on Control and Optimization</EM>, 34:244-263, 1996.
</DD>

<DT><!WA17><A NAME="billups.ferris:convergence"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1180.ps.Z">
  [BF96]</A></DT>
<DD>
S. C. Billups and M. C. Ferris.
<STRONG>Convergence of an infeasible interior-point algorithm from arbitrary
  positive starting points</STRONG>.
<EM>SIAM Journal on Optimization</EM>, 6:316-325, 1996.
</DD>

<DT><!WA18><A NAME="dirkse.ferris:path"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1179.ps.Z">
  [DF95]</A></DT>
<DD>
S. P. Dirkse and M. C. Ferris.
<STRONG>The PATH solver: A non-monotone stabilization scheme for mixed
  complementarity problems</STRONG>.
<EM>Optimization Methods and Software</EM>, 5:123-156, 1995.
</DD>

<DT><!WA19><A NAME="burke.ferris:gauss-newton"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1176.ps.Z">
  [BF95]</A></DT>
<DD>
J. V. Burke and M. C. Ferris.
<STRONG>A Gauss-Newton method for convex composite optimization</STRONG>.
<EM>Mathematical Programming</EM>, 71:179-194, 1995.
</DD>

<DT><!WA20><A NAME="ferris.mangasarian:parallel*1"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/93/tr1175.ps.Z">
  [FM94]</A></DT>
<DD>
M. C. Ferris and O. L. Mangasarian.
<STRONG>Parallel variable distribution</STRONG>.
<EM>SIAM Journal on Optimization</EM>, 4:815-832, 1994.
</DD>

<DT> <A NAME="ferris.lucidi:nonmonotone"> [FL94] </DT>
<DD>
M. C. Ferris and S. Lucidi.
<STRONG>Nonmonotone stabilization methods for nonlinear equations</STRONG>.
<EM>Journal of Optimization Theory and Applications</EM>, 81:53-71, 1994.
</DD>

<DT><!WA21><A NAME="cao.ferris:pivotal"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1114.ps.Z">
  [CF96]</A></DT>
<DD>
M. Cao and M. C. Ferris.
<STRONG>A pivotal method for affine variational inequalities</STRONG>.
<EM>Mathematics of Operations Research</EM>, 21:44-64, 1996.
</DD>

<DT><!WA22><A NAME="cao.ferris:interior"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/92/tr1101.ps.Z">
  [CF94]</A></DT>
<DD>
M. Cao and M. C. Ferris.
<STRONG>An interior point algorithm for monotone affine variational
  inequalities</STRONG>.
<EM>Journal of Optimization Theory and Applications</EM>, 83:269-283, 1994.
</DD>

<DT> <A NAME="ferris:linear"> [Fer93] </DT>
<DD>
M. C. Ferris.
<STRONG>The linear complementarity problem</STRONG>.
<EM>Bulletin of the American Mathematical Society</EM>, 28:169-175, 1993.
</DD>

<DT> <A NAME="eckstein.ferris:operator"> [EF92] </DT>
<DD>
J. Eckstein and M. C. Ferris.
<STRONG>Operator splitting methods for monotone linear complementarity
  problems</STRONG>.
TMC 239, Thinking Machines Corporation, Cambridge, MA 02142, 1992.
</DD>

<DT><!WA23><A NAME="dirkse.ferris.ea:gams"
  HREF="ftp://ftp.cs.wisc.edu/math-prog/tech-reports/94-07.ps.Z">
  [DFPR94]</A></DT>
<DD>
S. P. Dirkse, M. C. Ferris, P. V. Preckel, and T. Rutherford.
<STRONG>The GAMS callable program library for variational and complementarity
  solvers</STRONG>.
Mathematical Programming Technical Report 94-07, Computer Sciences Department,
  University of Wisconsin, Madison, Wisconsin, 1994.
</DD>

<DT><!WA24><A NAME="ferris.mangasarian:error"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1056a.ps.Z">
  [FM93]</A></DT>
<DD>
M. C. Ferris and O. L. Mangasarian.
<STRONG>Error bounds and strong upper semicontinuity for monotone affine
  variational inequalities</STRONG>.
<EM>Annals of Operations Research</EM>, 47:293-305, 1993.
</DD>

<DT><!WA25><A NAME="burke.ferris:weak"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1050a.ps.Z">
  [BF93]</A></DT>
<DD>
J. V. Burke and M. C. Ferris.
<STRONG>Weak sharp minima in mathematical programming</STRONG>.
<EM>SIAM Journal on Control and Optimization</EM>, 31:1340-1359, 1993.
</DD>

<DT> <A NAME="anderson.ferris:genetic*1"> [AF94] </DT>
<DD>
E. J. Anderson and M. C. Ferris.
<STRONG>Genetic algorithms for combinatorial optimization: The assembly line
  balancing problem</STRONG>.
<EM>ORSA Journal on Computing</EM>, 6:161-173, 1994.
</DD>

<DT><!WA26><A NAME="ferris.lucidi:globally"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1030.ps.Z">
  [FL91]</A></DT>
<DD>
M. C. Ferris and S. Lucidi.
<STRONG>Globally convergent methods for nonlinear equations</STRONG>.
Technical Report 1030, Computer Sciences Department, University of Wisconsin,
  Madison, Wisconsin, 1991.
</DD>

<DT><!WA27><A NAME="ferris:parallel"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1009a.ps.Z">
  [Fer94]</A></DT>
<DD>
M. C. Ferris.
<STRONG>Parallel constraint distribution for convex quadratic
  programs</STRONG>.
<EM>Mathematics of Operations Research</EM>, 19:645-658, 1994.
</DD>

<DT><!WA28><A NAME="bennett.ferris.ea:genetic"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/91/tr1004.ps.Z">
  [BFI91]</A></DT>
<DD>
K. Bennett, M. C. Ferris, and Y. E. Ioannidis.
<STRONG>A genetic algorithm for database query optimization</STRONG>.
In R.~K. Belew and L.~B. Booker, editors, <EM>Proceedings of the Fourth
  International Conference on Genetic Algorithms</EM>, pages 400-407, San
  Mateo, California, 1991. Morgan Kaufmann Publishers, Inc.
</DD>

<DT><!WA29><A NAME="ferris.mangasarian:parallel"
  HREF="ftp://ftp.cs.wisc.edu/tech-reports/reports/90/tr971a.ps.Z">
  [FM91]</A></DT>
<DD>
M. C. Ferris and O. L. Mangasarian.
<STRONG>Parallel constraint distribution</STRONG>.
<EM>SIAM Journal on Optimization</EM>, 1:487-500, 1991.
</DD>

<DT> <A NAME="cao.ferris:genetic"> [CF91] </DT>
<DD>
M. Cao and M. C. Ferris.
<STRONG>Genetic algorithms in optimization</STRONG>.
<EM>Journal of Undergraduate Mathematics and its Applications</EM>, 12:81-90,
  1991.
</DD>

<DT> <A NAME="burke.ferris.ea:clarke"> [BFQ92] </DT>
<DD>
J. V. Burke, M. C. Ferris, and M. Qian.
<STRONG>On the Clarke subdifferential of the distance function to a closed
  set</STRONG>.
<EM>Journal of Mathematical Analysis and its Applications</EM>, 166:199-213,
  1992.
</DD>

<DT> <A NAME="ferris.philpott:affine"> [FP92] </DT>
<DD>
M. C. Ferris and A. B. Philpott.
<STRONG>On affine scaling and semi-infinite programming</STRONG>.
<EM>Mathematical Programming</EM>, 56:361-364, 1992.
</DD>

<DT> <A NAME="anderson.ferris:genetic"> [AF90] </DT>
<DD>
E. J. Anderson and M. C. Ferris.
<STRONG>A genetic algorithm for the assembly line balancing problem</STRONG>.
In <EM>Proceedings of the Integer Programming / Combinatorial Optimization
  Conference, Waterloo, Ontario, Canada, May 28-30</EM>. University of
  Waterloo Press, 1990.
</DD>

<DT> <A NAME="ferris.vlach:scheduling"> [FV92] </DT>
<DD>
M. C. Ferris and M. Vlach.
<STRONG>Scheduling with earliness and tardiness penalties</STRONG>.
<EM>Naval Research Logistics Quarterly</EM>, 39:229-245, 1992.
</DD>

<DT> <A NAME="anderson.ferris:parallel"> [AF89] </DT>
<DD>
E. J. Anderson and M. C. Ferris.
<STRONG>Parallel genetic algorithms in optimization</STRONG>.
In <EM>Proceedings of the Fourth SIAM conference on Parallel Processing for
  Scientific Computing, Chicago, Illinois, December 11-13</EM>, 1989.
</DD>

<DT> <A NAME="ferris.mangasarian:minimum"> [FM92] </DT>
<DD>
M. C. Ferris and O. L. Mangasarian.
<STRONG>Minimum principle sufficiency</STRONG>.
<EM>Mathematical Programming</EM>, 57:1-14, 1992.
</DD>

<DT> <A NAME="burke.ferris:characterization"> [BF91] </DT>
<DD>
J. V. Burke and M. C. Ferris.
<STRONG>Characterization of solution sets of convex programs</STRONG>.
<EM>Operations Research Letters</EM>, 10:57-60, 1991.
</DD>

<DT> <A NAME="ferris:parallel*1"> [Fer89] </DT>
<DD>
M. C. Ferris.
<STRONG>Parallel solution of extremely large knapsack problems</STRONG>.
Technical Report 842, Computer Sciences Department, University of Wisconsin,
  Madison, Wisconsin, 1989.
</DD>

<DT> <A NAME="ferris.mangasarian:finite"> [FM91] </DT>
<DD>
M. C. Ferris and O. L. Mangasarian.
<STRONG>Finite perturbation of convex programs</STRONG>.
<EM>Applied Mathematics and Optimization</EM>, 23:263-273, 1991.
</DD>

<DT> <A NAME="ferris:iterative"> [Fer90] </DT>
<DD>
M. C. Ferris.
<STRONG>Iterative linear programming solution of convex programs</STRONG>.
<EM>Journal of Optimization Theory and Applications</EM>, 65:53-65, 1990.
</DD>

<DT> <A NAME="ferris:finite"> [Fer91] </DT>
<DD>
M. C. Ferris.
<STRONG>Finite termination of the proximal point algorithm</STRONG>.
<EM>Mathematical Programming</EM>, 50:359-366, 1991.
</DD>

<DT> <A NAME="ferris:weak*1"> [Fer88] </DT>
<DD>
M. C. Ferris.
<STRONG>Weak sharp minima and penalty functions in mathematical
  programming</STRONG>.
Technical Report 779, Computer Sciences Department, University of Wisconsin,
  Madison, Wisconsin, 1988.
</DD>

<DT> <A NAME="ferris.philpott:interior"> [FP89] </DT>
<DD>
M. C. Ferris and A. B. Philpott.
<STRONG>An interior point algorithm for semi-infinite linear
  programming</STRONG>.
<EM>Mathematical Programming</EM>, 43:257-276, 1989.
</DD>

<DT> <A NAME="ferris.philpott:performance"> [FP88] </DT>
<DD>
M. C. Ferris and A. B. Philpott.
<STRONG>On the performance of Karmarkar's algorithm</STRONG>.
<EM>Journal of the Operational Research Society</EM>, 39:257-270, 1988.
</DD>

<DT> <A NAME="ferris:weak"> [Fer88] </DT>
<DD>
M. C. Ferris.
<STRONG>Weak Sharp Minima and Penalty Functions in Mathematical
  Programming</STRONG>.
PhD thesis, University of Cambridge, England, 1988.
</DD>

<DT> <A NAME="ferris:linear*1"> [Fer85] </DT>
<DD>
M. C. Ferris.
<STRONG>Linear programming and minimum weight design - A comparison of methods
  for solving a class of structural optimization problems</STRONG>.
Master's thesis, University of Cambridge, England, 1985.
</DD>

</DL>
</BODY>
</HTML>
